package collection;

import java.util.*;

/** 集合的排序-----Point对象 */
public class SortPoint {
    public static void main(String[] args) {
        List<Point> list = new ArrayList<>();
        list.add(new Point(5,8));
        list.add(new Point(15,60));
        list.add(new Point(57,89));
        list.add(new Point(1,4));
        list.add(new Point(10,8));
        list.add(new Point(22,35));
        System.out.println("list的原始数据:"+list);

        Collections.sort(list, new Comparator<Point>() {
            public int compare(Point o1, Point o2) {
                return o1.getX()-o2.getX();//按X坐标升序
                //return o1.getY()-o2.getY();//按y坐标降序
                /*
                int len1 = o1.getX()*o1.getX()+o1.getY()*o1.getY();//点坐标，开平方，勾股定理
                int len2 = o2.getX()*o2.getX()+o1.getY()*o2.getY();
                //return len1-len2;//升序
                return len2-len1;//降序
                 */
                /*
                int len1 = o1.getX()+o1.getY();
                int len2 = o2.getX()+o2.getY();
                return len1-len2;
                 */
            }
        });
        System.out.println("排序后:"+list);

        list.sort(new Comparator<Point>() {
            public int compare(Point o1, Point o2) {
                return o1.getX()-o2.getX();//比较x大小升序
            }
        });

        System.out.println("----------------------分割线-------------------------");

        //Lambda表达式
        Collections.sort(list,(o1, o2) -> {
            int len1 = o1.getX()*o1.getX()+o1.getY()*o1.getY();//点坐标，开平方，勾股定理
            int len2 = o2.getX()*o2.getX()+o1.getY()*o2.getY();
            return len1-len2;
        });
    }
}